COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	Here are the two course descriptions.  I hope to have the other Monday.
C00005 ENDMK
C⊗;
Here are the two course descriptions.  I hope to have the other Monday.
If we can delay determining the quarters until I have the other lecturer,
it will be easier to accomodate the last guy, who may be harder to please.

Strong: (408) 927-1758
Nelson:	phone him at Digital Equipment Corp. Western Research Laboratories
in Palo Alto.

∂13-Feb-86  1006	STRONG@IBM-SJ.ARPA  
Received: from IBM-SJ.ARPA by SU-AI.ARPA with TCP; 13 Feb 86  10:06:07 PST
Date: 13 Feb 86 10:00:19 PST
From: STRONG@IBM-SJ.ARPA
To:   jmc@su-ai

Dear Professor McCarthy,
    Following is an abbreviated course description. I hope this fits
your requirments.
    Sincerely,
             Ray Strong
              FAULT TOLERANT DISTRIBUTED SYSTEMS

   Requirements  and  solutions  to  problems  arising  in  the
   context of  distributed systems  that must  tolerate faults.
   Special    emphasis:    atomic     broadcast    and    clock
   synchronization.    Design   decisions   for   a   prototype
   distributed  system that  reaches,  maintains, and  recovers
   from failure to maintain agreement.  Course organized around
   a series of problems of varying difficulty that students are
   challenged to solve, including some  problems that are still
   open.

From: gnelson@decwrl.DEC.COM (Greg Nelson)
Title: Methods for program verification

Description:

An introduction to practical methods for writing difficult programs
without errors.   Starting with axiomatic semantics, the predicate
calculus, and E. W. Dijkstra's theory of predicate transformers, the
course will lead into a series of example programs that will be derived
using the methods.  Additional topics, to be covered if time permits,
include mechanical theorem proving techniques, constraint languages,
and compiler correctness.

Nelson:  Fall quarter
Strong:  Winter quarter
Smith:  Spring